An algorithm of successive minimization in convex programming
نویسندگان
چکیده
منابع مشابه
An algorithm of successive minimization in convex programming
A gênerai exchange algorithm is gwen for the mimmizatwn ofa convex function with equahty and inequahty constraintsAt is a generahzation of the Cheney-Goldstein algorithm, but following an idea gwen by Topfer, afimte séquence ofsub-problems the dimension ofwhich is decreasing, is considered at each itération Gwen a positive number 8, under very gênerai conditions, it is proved that the method, a...
متن کاملAn Algorithm for Approximate Multiparametric Convex Programming
For multiparametric convex nonlinear programming problems we propose a recursive algorithm for approximating, within a given suboptimality tolerance, the value function and an optimizer as functions of the parameters. The approximate solution is expressed as a piecewise affine function over a simplicial partition of a subset of the feasible parameters, and it is organized over a tree structure ...
متن کاملA Parametric Successive Underestimation Method for Convex Programming Problems with an Additional Convex Multiplicative Constraint
A bstract This paper addresses itself to an algorithm for a convex minimization problem with an additional convex multiplicative constraint. A convex multiplicative constraint is such that a product of two convex functions is less than or equal to some constant. It is shown that this non convex problem can be solved by solving a sequence of convex programming problems. The basic idea of this al...
متن کاملAn Accelerated Inexact Proximal Point Algorithm for Convex Minimization
The proximal point algorithm (PPA) is classical and popular in the community of Optimization. In practice, inexact PPAs which solves the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact PPA with a new inexact criterion for solving convex minimization, and show that the iteration-complexity of this...
متن کاملAn Algorithm for Nonsmooth Convex Minimization With Errors
A readily implementable algorithm is given for minimizing any convex, not necessarily differentiable, function/of several variables. At each iteration the method requires only one approximate evaluation of /and its E-subgradient, and finds a search direction by solving a small quadratic programming problem. The algorithm generates a minimizing sequence of points, which converges to a solution w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Analyse numérique
سال: 1978
ISSN: 0399-0516
DOI: 10.1051/m2an/1978120403771